A Note on the Gradient Projection Method with Exact Stepsize Rule *1)
نویسندگان
چکیده
In this paper, we give some convergence results on the gradient projection method with exact stepsize rule for solving the minimization problem with convex constraints. Especially, we show that if the objective function is convex and its gradient is Lipschitz continuous, then the whole sequence of iterations produced by this method with bounded exact stepsizes converges to a solution of the concerned problem. Mathematics subject classification: 90C30, 65K05.
منابع مشابه
An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
We consider an incremental gradient method with momentum term for minimizing the sum of continuously differentiable functions. This method uses a new adaptive stepsize rule that decreases the stepsize whenever sufficient progress is not made. We show that if the gradients of the functions are bounded and Lipschitz continuous over a certain level set, then every cluster point of the iterates gen...
متن کاملAn inexact block-decomposition method for extra large-scale conic semidefinite programming
In this paper, we present an inexact block-decomposition (BD) first-order method for solving standard form conic semidefinite programming (SDP) which avoids computations of exact projections onto the manifold defined by the affine constraints and, as a result, is able to handle extra large SDP instances. The method is based on a two-block reformulation of the optimality conditions where the fir...
متن کاملStrong Convergence of a Double Projection-type Method for Monotone Variational Inequalities in Hilbert Spaces
We introduce a projection-type algorithm for solving monotone variational inequality problems in real Hilbert spaces. We prove that the whole sequence of iterates converges strongly to a solution of the variational inequality. The method uses only two projections onto the feasible set in each iteration in contrast to other strongly convergent algorithms which either require plenty of projection...
متن کاملA New Version of Extragradient Method for Variational Inequality Problems
In this paper, we propose a new version of extragradient method for the variational inequality problem. The method uses a new searching direction which differs from any one in existing projection-type methods, and is of a better stepsize rule. Under a certain generalized monotonicity condition, it is proved to be globally convergent. @ 2001 Eisevier Science Ltd. All rights reserved. Keywords-Vs...
متن کاملProjected Reflected Gradient Methods for Monotone Variational Inequalities
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a constant stepsize. It is similar to the projected gradient method, namely, the method requires only one projection onto the feasible set and only one value of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007